On pancyclic representable matroids
نویسندگان
چکیده
منابع مشابه
On pancyclic representable matroids
Bondy proved that an n-vertex simple Hamiltonian graph with at least n2/4 edges has cycles of every length unless it is isomorphic to Kn/2,n/2. This paper considers finding circuits of every size in GF (q)-representable matroids with large numbers of elements. A consequence of the main result is that a rank-r simple binary matroid with at least 2r−1 elements has circuits of all sizes or is isom...
متن کاملOn Representable Matroids and Ideal Secret Sharing
In secret sharing, the exact characterization of ideal access structures is a longstanding open problem. Brickell and Davenport (J. of Cryptology, 1991) proved that ideal access structures are induced by matroids. Subsequently, ideal access structures and access structures induced by matroids have attracted a lot of attention. Due to the difficulty of finding general results, the characterizati...
متن کاملCounting Bases of Representable Matroids
We show that it is #P-complete to count the number of bases of matroids representable over a fixed infinite field or fields of fixed characteristic.
متن کاملThe Excluded Minors for Gf(4)--representable Matroids the Excluded Minors for Gf(4){representable Matroids
There are exactly seven excluded minors for the class of GF(4){representable matroids. Note: The research for this paper was carried out under the PNA1.1-project P&BS of CWI, while J.F. Geelen and A. Kapoor visited the CWI in Amsterdam with nancial support from EIDMA.
متن کاملStabilizers for GF(5)-representable matroids
The matroid terminology follows Oxley [4]. Two r×n matrices A and A′ representing the same matroid M over a field GF(q) are called projectively equivalent representations of M if one can be obtained from the other by elementary row operations and column scaling. Otherwise they are called projectively inequivalent. The matrices A and A′ are called equivalent representations of M if, in addition ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2005
ISSN: 0012-365X
DOI: 10.1016/j.disc.2005.10.008